Distinguishing string selection problems

The Distinguishing String Selection Problem

In this paper we consider an approach to solve the distinguishing string selection problem. This approach is based on constructing logical models for the problem.

On Approximating String Selection Problems with Outliers

Many problems in bioinformatics are about finding strings that approximately represent a collection of given strings. We look at more general problems where some input strings can be classified as outliers. The Close to Most Strings problem is, given a set S of same-length strings, and a parameter d, find a string x that maximizes the number of “non-outliers” within Hamming distance d of x. We ...

Selected String Problems

Selected String Problems

Selected String Problems